An Improved Direct Dimension Exchange Method for Load Balancing in k-ary n-cube Multicomputers
نویسندگان
چکیده
This paper presents an improved direct dimension exchange method (DDE) for synchronous load balancing for k-ary n-cube multicom-puters. The new method is based on the improved DEM for hypercube. The original DEM when extended to the k-ary n-cube requires many iterations in exchanging loads between neighboring nodes to converge to a balanced state. The original DDE does not requires iteratively exchanging loads between nodes. It can balance the load with fewer communication steps and can provide better load balancing quality than DEM. The improved DDE has better load balancing quality than the original DDE and has the same complexity of the original DDE.
منابع مشابه
DDE: A Modified Dimension Exchange Method for Load Balancing in k-ary n-Cubes
| The dimension exchange method (DEM) was initially proposed as a load-balancing algorithm for the hypercube structure. It has been generalized to k-ary n-cubes. However, the k-ary n-cube algorithm must take many iterations to converge to a balanced state. In this paper, we propose a direct method to modify DEM. The new algorithm, Direct Dimension Exchange (DDE) method, takes load average in ev...
متن کاملThe Direct Dimension Exchange Method for Load
| The dimension exchange method (DEM) was initially proposed as a load-balancing algorithm for the hypercube structure. It has been generalized to k-ary n-cubes. However, the k-ary n-cube algorithm must take many iterations to converge to a balanced state. In this paper, we propose a direct method to modify DEM. The new algorithm, Direct Dimension Exchange (DDE) method, takes load average in ev...
متن کاملThe Generalized Dimension Exchange Method for Load Balancing in k-ary n Cubes and Variants
The Generalized Dimension Exchange (GDE) method is a fully distributed load balancing method that operates in a relaxation fashion for multicomputers with a direct communication network. It is parameterized by an exchange parameter that governs the splitting of load between a pair of directly connected processors during load balancing. An optimal would lead to the fastest convergence of the bal...
متن کاملNearest-neighbor algorithms for load-balancing in parallel computers
With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on localized workload information and manages workload migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms , the dimension-exchange (DE, for short) and the diiusion (DF, for short) methods and their several variants|the average dimension-exch...
متن کاملNearest neighbor algorithms for load balancing inparallel computersChengzhong
With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on localized workload information and manages workload migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms , the dimension-exchange (DE, for short) and the diiusion (DF, for short) methods and their several variants|the average dimension-exch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000